منابع مشابه
Bisimulations for fuzzy automata
Bisimulations have beenwidely used inmany areas of computer science tomodel equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the st...
متن کاملComputation of the greatest simulations and bisimulations between fuzzy automata
Recently, two types of simulations (forward and backward simulations) and four types of bisimulations (forward, backward, forward-backward, andbackward-forwardbisimulations) between fuzzyautomatahavebeen introduced. If there is at least one simulation/bisimulation of some of these types between the given fuzzy automata, it has been proved that there is the greatest simulation/bisimulation of th...
متن کاملCost Preserving Bisimulations for Probabilistic Automata
Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference notion for summarising the effect of abstraction. This paper considers probabilistic automata augmented with costs. It extends the notions of weak transition...
متن کاملForward Bisimulations for Nondeterministic Symbolic Finite Automata
Symbolic automata allow transitions to carry predicates over rich alphabet theories, such as linear arithmetic, and therefore extend classic automata to operate over infinite alphabets, such as the set of rational numbers. Existing automata algorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In our earlier work, we proposed new tech...
متن کاملBisimulations Meet PCTL Equivalences for Probabilistic Automata
Probabilistic automata (PA) [20] have been successfully applied in the formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on PCTL [11] and its extension PCTL [4]. Various behavioral equivalences are proposed for PAs, as a powerful tool for abstraction and compositio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Sets and Systems
سال: 2012
ISSN: 0165-0114
DOI: 10.1016/j.fss.2011.07.003